深度学习的关键批评之一是，需要大量昂贵且难以获得的训练数据，以便培训具有高性能和良好的概率功能的模型。专注于通过场景坐标回归（SCR）的单眼摄像机姿势估计的任务，我们描述了一种新的方法，用于相机姿势估计（舞蹈）网络的域改编，这使得培训模型无需访问目标任务上的任何标签。舞蹈需要未标记的图像（没有已知的姿势，订购或场景坐标标签）和空间的3D表示（例如，扫描点云），这两者都可以使用现成的商品硬件最少的努力来捕获。舞蹈渲染从3D模型标记的合成图像，通过应用无监督的图像级域适应技术（未配对图像到图像转换）来桥接合成和实图像之间的不可避免的域间隙。在实际图像上进行测试时，舞蹈培训的SCR模型在成本的一小部分中对其完全监督的对应物（在两种情况下使用PNP-RANSAC进行最终姿势估算的情况下）进行了相当的性能。我们的代码和数据集可以在https://github.com/jacklangerman/dance获得

Data-driven interatomic potentials have emerged as a powerful class of surrogate models for {\it ab initio} potential energy surfaces that are able to reliably predict macroscopic properties with experimental accuracy. In generating accurate and transferable potentials the most time-consuming and arguably most important task is generating the training set, which still requires significant expert user input. To accelerate this process, this work presents \text{\it hyperactive learning} (HAL), a framework for formulating an accelerated sampling algorithm specifically for the task of training database generation. The key idea is to start from a physically motivated sampler (e.g., molecular dynamics) and add a biasing term that drives the system towards high uncertainty and thus to unseen training configurations. Building on this framework, general protocols for building training databases for alloys and polymers leveraging the HAL framework will be presented. For alloys, ACE potentials for AlSi10 are created by fitting to a minimal HAL-generated database containing 88 configurations (32 atoms each) with fast evaluation times of <100 microsecond/atom/cpu-core. These potentials are demonstrated to predict the melting temperature with excellent accuracy. For polymers, a HAL database is built using ACE, able to determine the density of a long polyethylene glycol (PEG) polymer formed of 200 monomer units with experimental accuracy by only fitting to small isolated PEG polymers with sizes ranging from 2 to 32.

Density based representations of atomic environments that are invariant under Euclidean symmetries have become a widely used tool in the machine learning of interatomic potentials, broader data-driven atomistic modelling and the visualisation and analysis of materials datasets.The standard mechanism used to incorporate chemical element information is to create separate densities for each element and form tensor products between them. This leads to a steep scaling in the size of the representation as the number of elements increases. Graph neural networks, which do not explicitly use density representations, escape this scaling by mapping the chemical element information into a fixed dimensional space in a learnable way. We recast this approach as tensor factorisation by exploiting the tensor structure of standard neighbour density based descriptors. In doing so, we form compact tensor-reduced representations whose size does not depend on the number of chemical elements, but remain systematically convergeable and are therefore applicable to a wide range of data analysis and regression tasks.

在法医语音比较中，扬声器的嵌入在过去十年中已广泛流行。大多数审计的扬声器嵌入式嵌入都经过英语语料库进行培训，因为它很容易访问。因此，语言依赖性可能是自动法医语音比较的重要因素，尤其是当目标语言在语言上非常不同时。有许多商业系统可用，但是它们的模型主要接受与目标语言不同的语言（主要是英语）的培训。在低资源语言的情况下，开发用于法医目的的语料库，其中包含足够的扬声器来训练深度学习模型是昂贵的。这项研究旨在调查是否可以在目标低资源语言（匈牙利语）上使用预先培训的英语语料库的模型，与模型不同。另外，通常没有犯罪者（未知的扬声器）获得多个样本。因此，在有或没有说话者入学率的嫌疑人（已知）扬声器的情况下对样品进行比较。应用了两个语料库，这些语料库是专门用于法医目的的，第三个是用于传统演讲者验证的第三个语料库。使用了两种基于深度学习的扬声器嵌入向量提取方法：X-Vector和Ecapa-TDNN。说话者验证在可能性比率框架中进行了评估。在语言组合（建模，LR校准，评估）之间进行了比较。通过MinCllr和EER指标评估了结果。发现该模型以不同的语言进行了预先训练，但是在具有大量扬声器的语料库上，在语言不匹配的样本上表现良好。还检查了样本持续时间和口语样式的影响。发现相关样本的持续时间越长，性能就越好。另外，如果采用各种口语样式，则没有真正的区别。

缺乏自由获得的（现实生活或合成）高或超高维度的多级数据集可能会阻碍对特征筛查的快速增长的研究，尤其是在生物识别技术领域，在这种情况下，此类数据集使用很常见。本文报告了一个名为Biometricblender的Python软件包，它是一种超高维，多级合成数据生成器，可基于广泛的功能筛选方法进行基准测试。在数据生成过程中，用户可以控制混合特征的总体实用性和相互关系，因此合成特征空间能够模仿真实生物识别数据集的关键属性。

我们提出了一种新颖的方法来通过使用具有不同个性类型的代理来生成脚本。为了管理脚本中的字符交互，我们采用了模拟的戏剧网络。关于多个标准的自动和人类评估表明，我们的方法的表现优于基于香草-GPT2的基线。我们进一步引入了一个新的指标，以根据自然语言推论评估对话一致性并证明其有效性。

在计算化学和材料科学中，创建快速准确的力场是一项长期挑战。最近，已经证明，几个直径传递神经网络（MPNN）超过了使用其他方法在准确性方面构建的模型。但是，大多数MPNN的计算成本高和可伸缩性差。我们建议出现这些局限性，因为MPNN仅传递两体消息，从而导致层数与网络的表达性之间的直接关系。在这项工作中，我们介绍了MACE，这是一种使用更高的车身订单消息的新型MPNN模型。特别是，我们表明，使用四体消息将所需的消息传递迭代数减少到\ emph {两}，从而导致快速且高度可行的模型，达到或超过RMD17的最新准确性，3BPA和ACAC基准任务。我们还证明，使用高阶消息会导致学习曲线的陡峭程度改善。

Entropic regularization provides a generalization of the original optimal transport problem. It introduces a penalty term defined by the Kullback-Leibler divergence, making the problem more tractable via the celebrated Sinkhorn algorithm. Replacing the Kullback-Leibler divergence with a general $f$-divergence leads to a natural generalization. The case of divergences defined by superlinear functions was recently studied by Di Marino and Gerolin. Using convex analysis, we extend the theory developed so far to include all $f$-divergences defined by functions of Legendre type, and prove that under some mild conditions, strong duality holds, optimums in both the primal and dual problems are attained, the generalization of the $c$-transform is well-defined, and we give sufficient conditions for the generalized Sinkhorn algorithm to converge to an optimal solution. We propose a practical algorithm for computing an approximate solution of the optimal transport problem with $f$-divergence regularization via the generalized Sinkhorn algorithm. Finally, we present experimental results on synthetic 2-dimensional data, demonstrating the effects of using different $f$-divergences for regularization, which influences convergence speed, numerical stability and sparsity of the optimal coupling.